Reducibility of types in typed lambda calculus
نویسندگان
چکیده
منابع مشابه
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type operator is a meta-level operator, that is, there is no direct logical counterpart in the CurryHoward isomorphism sense. In particular, its meta-level nature implies that it does not correspond to the intuitionistic c...
متن کاملReducibility: A Ubiquitous Method in Lambda Calculus with Intersection Types
A general reducibility method is developed for proving reduction properties of lambda terms typeable in intersection type systems with and without the universal type Ω. Sufficient conditions for its application are derived. This method leads to uniform proofs of confluence, standardization, and weak head normalization of terms typeable in the system with the type Ω. The method extends Tait’s re...
متن کاملExtensional Isomorphisms of Inductive Types in Simply-Typed Lambda-Calculus
We study isomorphisms of types in the system of simply-typed λ-calculus with inductive types and recursion. It is shown that in some cases (multiproducts, copies of types), it is possible to add new reductions in such a way that strong normalisation and confluence of the calculus is preserved, and the isomorphisms may be regarded as intensional w.r.t. a stronger equality relation.
متن کاملSession Types in a Linearly Typed Multi-Threaded Lambda-Calculus
We present a formalization of session types in a multi-threaded lambda-calculus (MTLC) equipped with a linear type system, establishing for the MTLC both type preservation and global progress. The latter (global progress) implies that the evaluation of a well-typed program in the MTLC can never reach a deadlock. As this formulated MTLC can be readily embedded into ATS, a full-fledged language w...
متن کامل2 Dynamically typed lambda calculus
We present an extension of a statically typed language with a special type Dynamic and explicit type tagging and checking operations (coercions). Programs in run-time typed languages are viewed as incomplete programs that are to be completed to well-typed programs by explicitly inserting coercions into them. Such completions are generally not unique. If the meaning of an incomplete program is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1988
ISSN: 0890-5401
DOI: 10.1016/0890-5401(88)90054-5